A new interactive approach for solving fully fuzzy mixed integer linear programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS

Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...

متن کامل

A New Approach for Solving Fully Fuzzy Bilevel Linear Programming Problems

This paper addresses a type of fully fuzzy bilevel linear programming (FFBLP) wherein all the coefficients and decision variables in both the objective function and constraints are triangular fuzzy numbers. This paper proposes a new simple-structured, efficient method for FFBLP problems based on crisp bilevel programming that yields fuzzy optimal solutions with unconstraint variables and parame...

متن کامل

Solving fully fuzzy linear programming

In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear programming (abbreviated to FFLP) problems. Also, we employ linear programming (LP) with equality constraints to find a nonegative fuzzy number vector x which satisfies Ax =b, where A is a fuzzy number matrix. Then we investigate the existence of a positive solution of fully fuzzy linear system (FFLS).

متن کامل

A new method for solving fully fuzzy linear Bilevel programming problems

In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear Bilevel programming (FFLBLP) problems by representing all the parameters as triangular fuzzy numbers. In the proposed method, the given FFLBLP problem is decomposed into three crisp linear programming (CLP) problems with bounded variables constraints, the three CLP problems are solved separately...

متن کامل

A new approach for solving neutrosophic integer programming problems

Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: YUJOR

سال: 2020

ISSN: 0354-0243,1820-743X

DOI: 10.2298/yjor181015025k